Mallows Distance in VARFIMA(0, d, 0) Processes
نویسندگان
چکیده
In this work we present an extensive simulation study on Mallows distance in the context of Gaussian and non-Gaussian VARFIMA processes. Our main goal is to analyze the dependence among the components of VARFIMA processes through the Mallows distance point of view. A possible relationship between the Mallows distance and the fractional differencing parameter d, the type and level of dependence in the innovation process as well as its marginal behavior is investigated. We study the behavior of the Kendall’s τ dependence coefficient under the same framework for comparison purposes. For the Mallows distance, we consider an estimator based on the empirical marginal distribution function. Based on our simulation results, we propose both a semiparametric estimator for the fractional differencing parameter and a testing procedure to assess the presence of strong long range dependence in the components of VARFIMA processes of any (finite) dimension.
منابع مشابه
Linear Programming Bounds For Doubly-even Self-dual Codes - Information Theory, IEEE Transactions on
Using a variant of linear programming method we derive a new upper bound on the minimum distance d of doublyeven self-dual codes of length n. Asymptotically, for n growing, it gives d=n 0:166315 + o(1), thus improving on the Mallows–Odlyzko–Sloane bound of 1=6. To establish this, we prove that in any doubly even-self-dual code the distance distribution is asymptotically upper-bounded by the cor...
متن کاملTen Things We Should Know About Time Series
Time series data affect many aspects of our lives. This paper highlights ten things we should all know about time series, namely: a good working knowledge of econometrics and statistics, an awareness of measurement errors, testing for zero frequency, seasonal and periodic unit roots, analysing fractionally integrated and long memory processes, estimating VARFIMA models, using and interpreting c...
متن کاملA Skorohod Representation Theorem for Uniform Distance
Let μn be a probability measure on the Borel σ-field on D[0, 1] with respect to Skorohod distance, n ≥ 0. Necessary and sufficient conditions for the following statement are provided. On some probability space, there are D[0, 1]-valued random variables Xn such that Xn ∼ μn for all n ≥ 0 and ‖Xn − X0‖ → 0 in probability, where ‖·‖ is the sup-norm. Such conditions do not require μ0 separable unde...
متن کاملSampling and Learning Mallows and Generalized Mallows Models under the Cayley distance
The Mallows and Generalized Mallows models are compact yet powerful and natural ways of representing a probability distribution over the space of permutations. In this paper, we deal with the problems of sampling and learning such distributions when the metric on permutations is the Cayley distance. We propose new methods for both operations, and their performance is shown through several exper...
متن کاملThe Earth Mover's Distance is the Mallows Distance: Some Insights from Statistics
The Earth Mover’s distance was first introduced as a purely empirical way to measure texture and color similarities. We show that it has a rigorous probabilistic interpretation and is conceptually equivalent to the Mallows distance on probability distributions. The two distances are exactly the same when applied to probability distributions, but behave differently when applied to unnormalized d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Communications in Statistics - Simulation and Computation
دوره 42 شماره
صفحات -
تاریخ انتشار 2013